A Fitness Inheritance Evolutionary Algorithm for Solving Bi-criteria Flexible Process Sequencing Problems
نویسندگان
چکیده
This paper describes a novel fitness inheritance evolutionary algorithm for solving bi-criteria flexible process sequencing problems in flexible manufacturing systems (FMSs). FMS can be described as an integrated manufacturing system consisting of machines, computers, robots, and automated guided vehicles (AGVs). While FMSs give great advantages through the flexibility, FMSs pose complex problems on process sequencing of operations among multiple parts. Considering the machining time of operations and machine workload load balancing, the problem is formulated as bi-criteria flexible process sequencing problems (FPSs). An efficient multi-objective evolutionary algorithm with fitness inheritance mechanism is proposed to solve FPSs. The experimental results demonstrate that our approach can efficiently solve FPSs and fitness inheritance can speed up the convergence speed of the proposed algorithm.
منابع مشابه
طراحی و آموزش شبکه های عصبی مصنوعی به وسیله استراتژی تکاملی با جمعیت های موازی
Application of artificial neural networks (ANN) in areas such as classification of images and audio signals shows the ability of this artificial intelligence technique for solving practical problems. Construction and training of ANNs is usually a time-consuming and hard process. A suitable neural model must be able to learn the training data and also have the generalization ability. In this pap...
متن کاملFitness Inheritance In Multi-objective Optimization
In real-world multi-objective problems, the evaluation of objective functions usually requires a large amount of computation time. Moreover, due to the curse of dimensionality, solving multiobjective problems often requires much longer computation time than solving single-objective problems. Therefore, it is essential to develop efficiency enhancement techniques for solving multi-objective prob...
متن کاملَA Multi-objective simulated annealing algorithm to solving flexible no-wait flowshop scheduling problems with transportation times
This paper deals with a bi-objective hybrid no-wait flowshop scheduling problem minimizing the makespan and total weighted tardiness, in which we consider transportation times between stages. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. This paper presen...
متن کاملGenetic and Memetic Algorithms for Sequencing a New JIT Mixed-Model Assembly Line
This paper presents a new mathematical programming model for the bi-criteria mixed-model assembly line balancing problem in a just-in-time (JIT) production system. There is a set of criteria to judge sequences of the product mix in terms of the effective utilization of the system. The primary goal of this model is to minimize the setup cost and the stoppage assembly line cost, simultaneously. B...
متن کاملSolving a New Multi-objective Inventory-Routing Problem by a Non-dominated Sorting Genetic Algorithm
This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...
متن کامل